1995 Paper 4 Question 9 Computation Theory Explain what is meant by a primitive recursive function and by a partial recursive function. [6 marks]

Source URL: www.cl.cam.ac.uk

2004 Paper 4 Question 9 Computation Theory (a) Explain what is meant by the following statements: (i ) f : N → N is a total recursive (TR) function;

Source URL: www.cl.cam.ac.uk

On the completeness of quantum computation models Pablo Arrighi ´ Ecole normale sup´erieure de Lyon

Source URL: who.rocq.inria.fr

• Mathematical logic
• Applied mathematics
• Computable function
• Recursive set
• Enumeration
• Function
• Numbering
• Church–Turing thesis
• Computability
• Computability theory
• Theory of computation
• Mathematics

2001 Paper 4 Question 8 Computation Theory (a) Define precisely what is meant by the following: (i ) f (x1 , x2 , . . . xn ) is a Primitive Recursive (PR) function of arity n. [5 marks]

Source URL: www.cl.cam.ac.uk

BRICS Basic Research in Computer Science BRICS RSU. Kohlenbach: On the Uniform Weak K¨onig’s Lemma On the Uniform Weak K¨onig’s Lemma

Source URL: www.brics.dk

• Proof theory
• Computability theory
• Functions and mappings
• Reverse mathematics
• Mathematical proofs
• Primitive recursive function
• Gödel–Gentzen negative translation
• Primitive recursive arithmetic
• Second-order arithmetic
• Mathematics
• Mathematical logic
• Logic

Sober Spaces and Continuations Paul Taylor August 5, 2003 Abstract A topological space is sober if it has exactly the points that are dictated by its open sets. We explain the analogy with the way in which computational

Source URL: www.paultaylor.eu

• Functions and mappings
• Theoretical computer science
• Formal methods
• Models of computation
• Model theory
• Symbol
• Lambda calculus
• Interpretation
• Primitive recursive function
• Mathematics
• Mathematical logic
• Computability theory

Submitted to Sci. Math. Japonicae 1 Limiting rst order realizability interpretation Masahiro Nakata and Susumu Hayashi

Source URL: www.shayashi.jp

• Theory of computation
• Computability theory
• Function
• Integral calculus
• Primitive recursive function
• Fundamental theorem of calculus
• Mathematics
• Mathematical analysis
• Functions and mappings

Formal Certification of Code-Based Cryptographic Proofs Gilles Barthe1,2 Benjamin Gr´egoire1,3 Santiago Zanella1,3

Source URL: certicrypt.gforge.inria.fr

• Function
• XTR
• Computability theory
• Model theory
• Μ operator
• Primitive recursive function
• Mathematics
• Mathematical logic
• Functions and mappings

Synthesis Modulo Recursive Functions Etienne Kneuss1 Viktor Kuncak1 Ivan Kuraj1

Source URL: lara.epfl.ch

• Data types
• Lisp programming language
• Functional programming
• Recursion
• Computability theory
• ALGOL 68
• Function
• Fold
• Algebraic data type
• Software engineering
• Computer programming
• Computing

UTP Theories of Undefinedness Jim Woodcock & Victor Bandur University of York UTP Symposium, Paris: 27 August

Source URL: utp12.lri.fr

• Computability theory
• Formal methods
• Model theory
• Models of computation
• Lambda calculus
• Predicate
• Interpretation
• Function
• Primitive recursive function
• Logic
• Mathematical logic
• Mathematics